//      https://ac.nowcoder.com/acm/problem/16613




#include <iostream>
#include <cmath>
#include <string>
using namespace std;

bool prime(int n)
{
    if (n < 2) return false;
    if (n == 2) return true;
    if (n % 2 == 0) return false;
    for (int i = 3; i * i <= n; i += 2)
        if (n % i == 0) return false;
    return true;
}

int main()
{
    int a[26] = { 0 };
    string s;
    int maxn = -0x3f3f3f, minn = 0x3f3f3f;
    cin >> s;

    for (int i = 0; i < s.length(); i++)
        a[s[i] - 'a']++;
    for (int i = 0; i < 26; i++)
    {
        if (a[i] > maxn) maxn = a[i];
        if (a[i] < minn && a[i] != 0) minn = a[i];
    }

    if (prime(maxn - minn))
        cout << "Lucky Word" << endl << maxn - minn << endl;
    else
        cout << "No Answer" << endl << 0 << endl;
    return 0;
}
